A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours
نویسندگان
چکیده
One of the most satisfactory results in process theory is Milner’s axiomatization of strong bisimulation for regular CCS. This result holds for open terms with finite-state recursion. Wang has shown that timed bisimulation can also be axiomatized, but only for closed terms without recursion. In this paper, we provide an axiomatization for timed bisimulation of open terms with finite-state recursion.
منابع مشابه
An Axiomatization for Regular Processes in Times Branching Bisimulation
Klusener introduced a timed variant of branching bisimulation. In this paper it is shown that Klusener's axioms for nite process terms, together with two standard axioms for recursion, make a complete axiomatization for regular processes modulo timed branching bisimulation.
متن کاملA Complete Axiomatisation for Timed Automata
A proof system of timed bisimulation equivalence for timed automata is presented, based on a CCS-style regular language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. The proof...
متن کاملWeak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Sequential Processes
The Markovian behavioral equivalences defined so far treat exponentially timed internal actions like any other action. Since an exponentially timed internal action has a nonzero duration, it can be observed whenever it is executed between a pair of exponentially timed noninternal actions. However, no difference may be noted at steady state between a sequence of exponentially timed internal acti...
متن کاملStatic Analysis Versus Model Checking for Bug Finding
The benefits of exposing calls and returns p. 2 A compositional approach to the stochastic dynamics of gene networks p. 4 Games other people play p. 5 Type-directed concurrency p. 6 Multiport interaction nets and concurrency p. 21 Model checking for [pi]-calculus using proof search p. 36 A game semantics of the asynchronous [pi]-calculus p. 51 Efficient on-the-fly algorithms for the analysis of...
متن کاملAn Elimination Theorem for Regular Behaviours with Integration
This chapter deals with an extension of the process algebra ACP with rational time and integration. We determine a proper subdomain of the regular processes for which an elimination theorem holds, namely, for each pair of processes p0 ; p1 in this class there is a process q in this class such that p0kp1 and q are bisimilar. Some simple examples show that if this subdomain is enlarged, then the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 152 شماره
صفحات -
تاریخ انتشار 1995